DUALITY AND DECOMPOSITION FOR EXTENDED LINEAR-QUADRATIC STOCHASTIC CONTROL PROBLEMS IN DISCRETE TIME y
نویسنده
چکیده
New dual problems emphasizing decomposability are established for a general class of stochastic dynamic optimization problems, with piecewise linearquadratic objective function. Optimality conditions are derived which emphasize decomposition. The dual dynamics are conditioned on the available system state information, and this leads to a symmetry that is well-suited to computational methods such as operator splitting.
منابع مشابه
Duality and optimality in multistagestochastic programming
A model of multistage stochastic programming over a scenario tree is developed in which the evolution of information states, as represented by the nodes of a scenario tree, is supplemented by a dynamical system of state vectors controlled by recourse decisions. A dual problem is obtained in which multipliers associated with the primal dynamics are price vectors that are propagated backward in t...
متن کاملA Duality Theory with Zero Duality Gap for Nonlinear Programming
Duality is an important notion for constrained optimization which provides a theoretical foundation for a number of constraint decomposition schemes such as separable programming and for deriving lower bounds in space decomposition algorithms such as branch and bound. However, the conventional duality theory has the fundamental limit that it leads to duality gaps for nonconvex optimization prob...
متن کاملThe singular solutions to a singular quadratic
A number of generalizations of singular cluacfratic minimization theory for the finitetime case are considered. Also new stahilit,y results are derived for the infinite time problem, and novel techniques are intr(xluccd to facilitate the derivation of singular solutions for this case. of significance is the fact that the ncw results make evident the duality that exists between singular control ...
متن کاملA Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
We present a Cost Decomposition approach for the linear Multicommodity Min-Cost Flow problem, where the mutual capacity constraints are dualized and the resulting Lagrangean Dual is solved with a dual-ascent algorithm belonging to the class of Bundle methods. Although decomposition approaches to block-structured Linear Programs have been reported not to be competitive with general-purpose softw...
متن کاملSolution of Coercive and Semicoercive Contact Problems by FETI Domain Decomposition
A new Neumann-Neumann type domain decomposition algorithm for the solution of contact problems of elasticity and similar problems is described. The discretized variational inequality that models the equilibrium of a system of elastic bodies in contact is first turned by duality to a strictly convex quadratic programming problem with either box constraints or box and equality constraints. This s...
متن کامل